Logic Programs with Possibilistic Ordered Disjunction
نویسندگان
چکیده
Logic programs with ordered disjunction have shown to be a flexible specification language able to model common user preferences in a natural way. However, in some realistic scenarios the preferences should be linked to the evidence of the information when trying to reach a single preferred solution. In this paper, we extend the syntax and the semantics of logic programs with ordered disjunction in order to cope with uncertain information. In particular, we define a possibilistic semantics for capturing possibilistic ordered disjunction programs. We use a simple example to explain the approach and outline an application scenario showing the benefits of possibilistic ordered disjunction.
منابع مشابه
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of sel...
متن کاملA Preference Meta-Model for Logic Programs with Possibilistic Ordered Disjunction
This paper presents an approach for specifying user preferences related to services by means of a preference meta-model, which is mapped to logic programs with possibilistic ordered disjunction following a Model-Driven Methodology (MDM). MDM allows to specify problem domains by means of meta-models which can be converted to instance models or other meta-models through transformation functions. ...
متن کاملTowards the Implementation of a Preference- and Uncertain-Aware Solver Using Answer Set Programming
Logic programs with possibilistic ordered disjunction (or LPPODs) are a recently defined logic-programming framework based on logic programs with ordered disjunction and possibilistic logic. The framework inherits the properties of such formalisms and merging them, it supports a reasoning which is nonmonotonic, preferenceand uncertain-aware. The LPPODs syntax allows to specify 1) preferences in...
متن کاملWeak and Strong Disjunction in Possibilistic ASP
Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the curre...
متن کاملNested Logic Programs with Ordered Disjunction
In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LPODs), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions. We define the LPODs semantics in a simple way and we extend most of ...
متن کامل